Evaluating Typical Algorithms of Combinatorial Optimization to Solve Continuous-Time Based Scheduling Problem
نویسندگان
چکیده
منابع مشابه
A Collaborative Search Strategy to Solve Combinatorial Optimization and Scheduling Problems 125 A Collaborative Search Strategy to Solve Combinatorial Optimization and Scheduling Problems
Since the creation of operations research as a discipline, a continued interest has been in the development of heuristics or approximation algorithms to solve complex combinatorial optimization problems. As many problems have been proven computationally intractable, the heuristic approaches become increasingly important in solving various large practical problems. The most popular heuristics th...
متن کاملFew heuristic optimization algorithms to solve the multi-period fixed charge production-distribution problem
This paper deals with a multi-period fixed charge production-distribution problem associated with backorder and inventories. The objective is to determine the size of the shipments from each supplier and backorder and inventories at each period, so that the total cost incurred during the entire period towards production, transportation, backorder and inventories is minimised. A 0-1 mixed intege...
متن کاملUsing Simulated Annealing and Ant-Colony Optimization Algorithms to Solve the Scheduling Problem
The scheduling problem is one of the most challenging problems faced in many different areas of everyday life. This problem can be formulated as a combinatorial optimization problem, and it has been solved with various methods using meta-heuristics and intelligent algorithms. We present in this paper a solution to the scheduling problem using two different heuristics namely Simulated Annealing ...
متن کاملGenetic Algorithms Based Approach to Solve 0-1 Knapsack Problem Optimization Problem
In this paper, we solve 0-1 knapsack problem using genetic algorithm. The knapsack problem is also called the NP (non deterministic polynomial) problem. We have to maximize the profit value that can be put in to a knapsack under the confinement of its weight. Solve the knapsack problem and also show its possible and effectiveness crowd an example. The Genetic Algorithm uses corrupted renewal an...
متن کاملProfile-Based Algorithms to Solve Multiple Capacitated Metric Scheduling Problems
Though CSP scheduling models have tended to assume fairly general representations of temporal constraints, most work has restricted attention to problems that require allocation of simple, unit-capacity r~=,ources. This paper considers an extended class of scheduling problems where resources have capacity to simultaneously support more than one activity, and resource availability at any point i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2018
ISSN: 1999-4893
DOI: 10.3390/a11040050